GPU-Based Neighbor-Search Algorithm for Particle Simulations
نویسندگان
چکیده
This paper presents a neighbor-search technique to be used in a GPU-based particle simulation framework. Neighbor searching is usually the most computationally expensive step in particle simulations. The usual approach is to subdivide the simulation space to speed up neighbor search. Here, we present a grid-based neighbor-search technique designed to work on programmable graphics hardware.
منابع مشابه
Adaptive Smoothed Particle Hydrodynamics Neighbor Search Algorithm for Large Plastic Deformation Computational Solid Mechanics
Smoothed Particle Hydrodynamics (SPH) has quickly become one of the most popular mesh-free methods since its introduction in 1977. In the recent years, a great amount of research has been focused on addressing some of the common computational time associated with the SPH method. One of the remaining hurdles is the long computational associated with building the neighbor list. Because of the nat...
متن کاملConstrained neighbor lists for SPH-based fluid simulations
In this paper we present a new approach to create neighbor lists with strict memory bounds for incompressible Smoothed Particle Hydrodynamics (SPH) simulations. Our proposed approach is based on a novel efficient predictive-corrective algorithm that locally adjusts particle support radii in order to yield neighborhoods of a user-defined maximum size. Due to the improved estimation of the initia...
متن کاملDynamic Particle Coupling for GPU-based Fluid Simulation
The main research approaches in Computational Fluid Dynamics (CFD) are grid-based (Euler) or based on particle motion (Lagrange). For interactive fluid simulation, techniques have been developed to use the Graphics Processing Unit (GPU) to speed up the computation using an Eulerian approach. This paper describes an approach for setting up a Lagrangian particle based fluid simulation on the GPU....
متن کاملOut-of-Core Proximity Computation for Particle-based Fluid Simulations
To meet the demand of higher realism, a high number of particles are used for particle-based fluid simulations, resulting in various out-of-core issues. In this paper, we present an out-of-core proximity computation, especially, ε-Nearest Neighbor (ε-NN) search, commonly used for particle-based fluid simulations, to handle such big data sets consisting of tens of millions of particles. Specific...
متن کاملAn approach to Improve Particle Swarm Optimization Algorithm Using CUDA
The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Graphics, GPU, & Game Tools
دوره 14 شماره
صفحات -
تاریخ انتشار 2009